A Q-Learning-Based Approximate Solving Algorithm for Vehicular Route Game

نویسندگان

چکیده

Route game is recognized as an effective method to alleviate Braess’ paradox, which generates a new traffic congestion since numerous vehicles obey the same guidance from selfish route (such Google Maps). The conventional games have symmetry vehicles’ payoffs depend only on selected distribution but not who chose, leads precise Nash equilibrium being able be solved by constructing special potential function. However, with arrival of smart cities, real-time schemes more concerned engineers than absolute optimality in real traffic. It easy task re-construct functions due dynamic conditions. In this paper, compared hard-solvable function-based method, matched Q-learning algorithm designed generate approximate classic for An experimental study shows that coefficients generated Q-learning-based solving all converge 1.00, and still required convergence different parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approximate Algorithm for Solving the Watchman Route Problem

The watchman route problem (WRP) was first introduced in 1988 and is defined as follows: How to calculate a shortest route completely contained inside a simple polygon such that any point inside this polygon is visible from at least one point on the route? So far the best known result for the WRP is an O(nlogn) runtime algorithm (with inherent numerical problems of its implementation). This pap...

متن کامل

A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

VARON : Vehicular Ad hoc Route Optimisation for NEMO q , qq

In this paper, we analyse the provision of enhanced communications between vehicles. It is expected that vehicles will have several communication devices, and that a specialised node will provide external connectivity to these devices, i.e., the devices in the vehicle form a Mobile Network. We propose the use of Network Mobility communication solutions for providing access from the vehicles to ...

متن کامل

A reactive bone route algorithm for solving the traveling salesman problem

The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sustainability

سال: 2022

ISSN: ['2071-1050']

DOI: https://doi.org/10.3390/su141912033